Construction and Performance Analysis of BIBD-QC-LDPC Codes for Correcting Erasure-Bursts
نویسندگان
چکیده
This paper presents a novel approach for constructing structured regular QC-LDPC codes based on a special type of combinatorial designs,known as the balanced incomplete block design (BIBD).The code design approach based on the technology of block cyclic shift and dispertion (BCSD) for correcting erasure-bursts over the binary bursts erasure channel (BBEC). Furthermore, the Tanner graph of the constructed codes is free of 4cycles, hence the BCSD-QC-LDPC codes have girth at least 6. The simulation results show that the BCSD-QC-LDPC codes perform well over the BBEC channel with iterative message-passing decoding.
منابع مشابه
On the erasure-correcting capabilities of low-complexity decoded LDPC codes with constituent Hamming codes
Low-density parity-check (LDPC) codes can be constructed using constituent block codes other than single parity-check (SPC) codes. This paper considers random LDPC codes with constituent Hamming codes and investigates their asymptotic performance over the binary erasure channel. It is shown that there exist Hamming code-based LDPC codes which, when decoded with a low-complexity iterative algori...
متن کاملGTTI 2008: sessione Trasmissione Numerica Non-binary LDPC codes with good performance on channels affected by bursty noise
Non-binary Reed-Solomon (RS) codes represent a typical way to counteract the effects of error bursts in hard-disk drives (HDD). Recently, it has been demonstrated how q-ary low-density paritycheck (LDPC) codes can outperform RS codes through a proper construction of the parity check (PC) matrix. In this work, two matrix design schemes, based on the main definitions of erasure burst proposed in ...
متن کاملImproving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes
This paper proposes an efficient joint secret key encryption-channel coding cryptosystem, based on regular Extended Difference Family Quasi-Cyclic Low-Density Parity-Check codes. The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Ra...
متن کاملBurst Correction Coding From Low-Density Parity-Check Codes
BURST CORRECTION CODING FROM LOW-DENSITY PARITY-CHECK CODES Wai Han Fong, PhD George Mason University, 2015 Dissertation Director: Dr. Shih-Chun Chang Dissertation Co-Director: Dr. Shu Lin This thesis explores techniques and theoretical bounds on efficiently encodable low-density parity-check (LDPC) codes for correcting single and multiple bursts of erasures and/or errors. The approach is to co...
متن کاملA Graphical Model and Search Algorithm Based Quasi-Cyclic Low-Density Parity-Check Codes Scheme
A constant challenge in Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes lies on flexible code lengths and rates, conditioned by good error performance. This paper presents an optimal construction method of QC-LDPC Codes on the basis of graphical model and search algorithm. Utilizing the proposed scheme, we can construct adaptable QC-LDPC codes whose girths are no less than 12, and column ...
متن کامل